Symbolization of generating functions; an application of the Mullin-Rota theory of binomial enumeration
نویسندگان
چکیده
We have found that there are more than a dozen classical generating functions that could be suitably symbolized to yield various symbolic sum formulas by employing Mullin-Rota’s theory of binomial enumeration. Various special formulas and identities involving well-known number sequences or polynomial sequences are presented as illustrative examples. The convergence of the symbolic summations is discussed. AMS 2000 Subject Classification 39A70, 65B10, 05A15, 40A30. ∗The research of this author was partially supported by ASD Grant and sabbatical leave of the Illinois Wesleyan University. †The research of this author was partially supported by Applied Research Initiative Grant of UCCSN and sabbatical leave of UNLV.
منابع مشابه
Umbral Calculus, Binomial Enumeration and Chromatic Polynomials
We develop the concept of partition categories, in order to extend the Mullin-Rota theory of binomial enumeration, and simultaneously to provide a natural setting for recent applications of the Roman-Rota umbral calculus to computations in algebraic topology. As a further application, we describe a generalisation of the chromatic polynomial of a graph. 0. Introduction. In the last 20 years, the...
متن کاملFrom sets to functions: Three elementary examples
In the paper “On the foundations of combinatorial theory III. Theory of binomial enumeration” [7-j, Mullin and Rota developed the theory of polynomials of binomial type (definitiou below). They observed that in many cases these sequences of polynomials and the linear relations between them, given by the so-called connection constants, could be treated set-theoretically. But the problem of exten...
متن کاملEnumeration and Generating Functions of Rota-Baxter Words
In this paper, we prove results on enumerations of sets of Rota-Baxter words in a single generator and one unary operator. Examples of operators are integral operators, their generalization to Rota-Baxter operators, and Rota-Baxter type operators. Rota-Baxter words are certain words formed by concatenating generators and images of words under the operators. Under suitable conditions, they form ...
متن کاملThe Order Steps of an Analytic Combinatorics
Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. This theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology and information theory. With a caref...
متن کاملOn the Combinatorics of the Boros-Moll Polynomials
The Boros-Moll polynomials arise in the evaluation of a quartic integral. The original double summation formula does not imply the fact that the coefficients of these polynomials are positive. Boros and Moll proved the positivity by using Ramanujan’s Master Theorem to reduce the double sum to a single sum. Based on the structure of reluctant functions introduced by Mullin and Rota along with an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Mathematics with Applications
دوره 54 شماره
صفحات -
تاریخ انتشار 2007